Solving Neutrosophic Travelling Salesaman Problem in Triangular Fuzzy Number Using Ones Assignment Method
نویسندگان
چکیده
منابع مشابه
Shortest Path Problem Under Triangular Fuzzy Number Neutrosophic Information
In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed appr...
متن کاملOnes Assignment Method for Solving Assignment Problems
Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...
متن کاملA Critical Path Problem Using Intuitionistic Triangular Fuzzy Number
Critical path method is a network based method planned for development and organization of complex project in real world application. In this paper, a new methodology has been made to find the critical path in a directed acyclic graph, whose activity time uncertain. The vague parameters in the network are represented by intuitionistic triangular fuzzy numbers, instead of crisp numbers. A new pr...
متن کاملA Method for Solving Intuitionistic Fuzzy Assignment Problem Using Branch and Bound Method
In this paper, we investigate an assignment problem in which cost coefficients are triangular intuitionistic fuzzy numbers. In conventional assignment problem, cost is always certain. This paper develops an approach to solve an intuitionistic fuzzy assignment problem where cost is not deterministic numbers but imprecise ones. Here, the elements of the costs (profits) matrix of the assignment pr...
متن کاملFast Exact Method for Solving the Travelling Salesman Problem
Let apply this cutting procedure for ... 3 2 1 − − − → → N N N R R R sub-routes. One can readily see that there will be progressive increasing in the disturbances of sub-routes length, i.e. | ) ( ) ( | | ) ( ) ( | 1 1 − + − ≤ − k k k k R D R D R D R D , ,... 3 , 2 − − = N N k As result of application these transformations sequence, we should obtain N P r r r r R ∈ = 2 1 2 1 2 , }, , { sub-route...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Psychosocial Rehabilitation
سال: 2020
ISSN: 1475-7192
DOI: 10.37200/ijpr/v24i4/pr201591